A Branching Time Semantics for the Ada Rendezvous Mechanism
نویسندگان
چکیده
Bmnching-time semantica bed on domaiw built upon tree structures have been proposed to model concurrent proceases. Howeoer, the re8ulting model8 imposed severe re8triction8 to ensure mondonicity and compohtionality. To address these iaauea, we conrtruct a semantic domain without racr$cing these two propertk8. We ako provide a simpk and faithfid semantics of the Ada rendezvous mechanism.
منابع مشابه
A Comparison of the Concurrency and Real-Time Features of Ada 95 and Java
1. ABSTRACT Both Ada and Java support concurrent programming, but through quite different approaches. Ada has built-in tasking features with concurrency semantics, independent of the language’s OOP model, whereas Java’s thread support relies on OOP and is based on special execution properties of methods in several predefined classes. Ada achieves mutual exclusion through protected objects with ...
متن کاملARTK-M2: a Kernel for Ada Tasking Requirements: an Implementation and an Automatic Generator
A run-time kernel, ARTK-M2, supporting Ada tasking semantics is discussed; full support for task creation, synchronization, communication, scheduling, and termination is provided, together with all options of the Ada rendezvous. An implementation in Modula-2 is presented and a method for automatically translating Ada programs into semantically equivalent Modula-2 programs with corresponding ker...
متن کاملModeling of Advanced Tasking in Ada-95: A Petri Net Perspective
The Ada language has been designed to support development of concurrent and distributed sojiware. While the Ada-83 standard defined the basic mechanisms of rendezvous-based tasking, the Ada-95 standard significantly extended this capability with the introduction of several advanced tasking constructs. We present and discuss formal models of these key tasking constructs using the Petri net model...
متن کاملModelling remote concurrency with Ada. Case study of symmetric non-deterministic rendezvous
When developing concurrent software, a proper engineering practice is to choose a good level of abstraction for expressing concurrency control. Ideally, this level should provide platform-independent abstractions but, as the platform concurrency behaviour cannot be ignored, this abstraction level must also be able to cope with it and exhibit the influence of different possible behaviours. We st...
متن کاملAsynchronous Rendez-vous in Distributed Logic Programming
In this paper the semantics of the communication mechanism of the distributed logic programming language DLP is studied. DLP combines logic programming with object oriented features and parallelism. For an abstract subset of DLP both an operational and denotational semantics is given. The language DLP supports active objects, method call by rendezvous and moreover (distributed) backtracking ove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996